Representation of left-computable ε-random reals
نویسندگان
چکیده
Article history: Received 5 June 2009 Received in revised form 25 July 2010 Accepted 4 August 2010 Available online 10 August 2010
منابع مشابه
Random Semicomputable Reals Revisited
The aim of this paper is to present a nice series of results, obtained in the papers of Chaitin [2], Solovay [5], Calude et al. [1], Kucera and Slaman [3]. This joint effort led to a full characterization of lower semicomputable random reals, both as those that can be expressed as a “Chaitin Omega” and those that are maximal for Solovay reducibility. The original proofs were somewhat involved; ...
متن کاملDegrees of Weakly Computable Reals
A real α is left-recursively enumerable (left-r.e. for short) if we can effectively generate α from below. That is, the left Dedkind cut of α, L(α) = {q ∈ Q : q ≤ α}, forms a r.e. set. Equivalently, a real α is left-r.e. if it is the limit of a converging recursive increasing sequence. If we can also compute the radius of convergence effectively, then α is recursive. Left-r.e. reals are the mea...
متن کاملDegree-Theoretic Aspects of Computably Enumerable Reals
A real is computable if its left cut, L( ); is computable. If (qi)i is a computable sequence of rationals computably converging to ; then fqig; the corresponding set, is always computable. A computably enumerable (c.e.) real is a real which is the limit of an increasing computable sequence of rationals, and has a left cut which is c.e. We study the Turing degrees of representations of c.e. real...
متن کاملComputable Approximations of Reals: An Information-Theoretic Analysis
How fast can one approximate a real by a computable sequence of rationals? We show that the answer to this question depends very much on the information content in the nite pre xes of the binary expansion of the real. Computable reals, whose binary expansions have a very low information content, can be approximated (very fast) with a computable convergence rate. Random reals, whose binary expan...
متن کاملSolovay Reducibility on D-c.e Real Numbers
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The Solovay reducibility classifies elegantly the relative randomness of c.e. reals. Especially, the c.e. random reals are complete unter the Solovay reducibility for c.e. reals. In this paper we investigate an extension...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 77 شماره
صفحات -
تاریخ انتشار 2011